package leetcode.code0699;

import java.util.List;

import leetcode.IDebug;
import leetcode.helper.HelpDebug;

public abstract class Solution699 implements IDebug {
	public abstract List<Integer> fallingSquares(int[][] positions);
	@Override
	public void debug1() {
		String str = "[[1,2],[2,3],[6,1]]";//
		int[][] positions = HelpDebug.str2array1(str);
		String str1 = "[2,5,5]";
		List<Integer> e = HelpDebug.str2intlist(str1);
		List<Integer> r = this.fallingSquares(positions);
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug2() {
		String str = "[[100,100],[200,100]]";
		int[][] positions = HelpDebug.str2array1(str);
		String str1 = "[100,100]";
		List<Integer> e = HelpDebug.str2intlist(str1);
		List<Integer> r = this.fallingSquares(positions);
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug3() {
		String str = "[[1,2],[1,3]]";
		int[][] positions = HelpDebug.str2array1(str);
		String str1 = "[2,5]";
		List<Integer> e = HelpDebug.str2intlist(str1);
		List<Integer> r = this.fallingSquares(positions);
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug4() {
		// TODO Auto-generated method stub

	}

}
